Model Checking of Time Petri Nets
نویسندگان
چکیده
This paper considers time Petri nets (TPN model) for model checking. The main challenge in model checking techniques is to construct, with lesser resources (time and space), a much coarser abstraction preserving properties of interest. These properties can be verified using standard model checking techniques. In this paper, we review some techniques, proposed in the literature, to model check untimed and timed properties of the TPN.
منابع مشابه
Hybrid Time Delay Petri Nets as a Mathematical Novel Tool to Model Dynamic System with Current Sample Time
The existing modeling methods using Petri Nets, have been successfully applied to model and analyze dynamic systems. However, these methods are not capable of modeling all dynamic systems such as systems with the current sample time signals, systems including various subsystems and multi-mode systems. This paper proposes Hybrid Time Delay Petri Nets (HTDPN) to solve the problem. In ...
متن کاملSAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets
Formal methods among them the model checking techniques play an important role in the design and production of both systems and software. In this paper we deal with an adaptation of the bounded model checking methods for timed systems, developed for timed automata, to the case of time Petri nets. We consider distributed time Petri nets and parametric reachability checking, but the approach can ...
متن کاملModel Checking for Linear Time μ - calculus and Extended Petri Nets ∗ Presented at 5 th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing SYNACS 03 , Timişoara , Romania
Finite jumping and L3-conditional Petri nets, where L3 denotes the family of regular languages, are two proper extensions of Petri nets. In this paper we show that the linear time μ-calculus model checking problem for such Petri net extensions is decidable. Complexity issues are also discussed.
متن کاملPartial order reductions for checking
The paper deals with veriication of untimed branching time properties of Time Petri Nets. The atomic variant of the geometric region method for preserving properties of CTL and ACTL is improved. Then, it is shown, for the rst time, how to apply the partial order reduction method to deal with next-time free branching properties of Time Petri Nets. The above two results are combined ooering an ee...
متن کاملChecking Linear Temporal Formulas on Sequential Recursive Petri Nets
Recursive Petri nets (RPNs) have been introduced to model systems with dynamic structure. Whereas this model is a strict extension of Petri nets and contextfree grammars (w.r.t. the language criterion), reachability in RPNs remains decidable. However the kind of model checking which is decidable for Petri nets becomes undecidable for RPNs. In this work, we introduce a submodel of RPNs called se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006